A scatter search algorithm for time-dependent prize-collecting arc routing problems

Prize-collecting Arc Routing Problems and Extensions

In this work we present the Prize-collecting Arc Routing Problem and some extensions. We derive properties that allow determining linear defining systems for the problems and solution approaches based on upper bounds obtained from relaxations reinforced with cuts, and lower bounds derived from heuristics. We also present numerical results from computational experiments that show that in many ca...

The Time-Dependent Multiple-Vehicle Prize-Collecting Arc Routing Problem

In this paper, we introduce a multi vehicle version of the Time-Dependent PrizeCollecting Arc Routing Problem (TD-MPARP). It is inspired by a situation where a transport manager has to choose between a number of full truck load pick-ups and deliveries to be performed by a fleet of vehicles. Real-life traffic situations where the travel times change with the time of day are taken into account. T...

The time-dependent prize-collecting arc routing problem

The Clustered Prize-Collecting Arc Routing Problem

Prize-collecting Arc Routing Problems are arc routing problems where, in addition to the cost function, there is a profit function on the edges that must be taken into account only the first time that an edge is traversed. In this work we present the Clustered Prize-collecting Arc Routing Problem where there are clusters of arcs and, for each cluster, we require that either all its links are se...

A Tabu Scatter Search Metaheuristic for the Arc Routing Problem

We consider a special routing problem which has a variety of practical applications. In a graph-theoretic context it is known as the Capacitated Chinese Postman Problem. Given an undirected network in which the demand is located on edges, the goal is to determine a least-cost schedule of routes. The route demands, which must not exceed the vehicle capacity, are serviced by a fleet of vehicles w...